Scalable Interactive Dynamic Graph Clustering on Multicore CPUs
نویسندگان
چکیده
منابع مشابه
OpenCL on shared memory multicore CPUs
Shared memory multicore processor technology is pervasive in mainstream computing. This new architecture challenges programmers to write code that scales over these many cores to exploit the full computational power of these machines. OpenMP and Intel Threading Building Blocks (TBB) are two of the popular frameworks used to program these architectures. Recently, OpenCL has been defined as a sta...
متن کاملMagnus integrators on multicore CPUs and GPUs
In the present paper we consider numerical methods to solve the Schr\"odinger equation with a time dependent Hamiltonian. We will consider both short-range interactions, which lead to evolution equations involving sparse matrices, and long-range interactions, which lead to dense matrices. Both of these settings show very different computational characteristics. We use Magnus integrators for tim...
متن کاملInteractive Graph Clustering based on User Hints
Graph clustering is a difficult optimization problem that arises in Software Engineering. This paper presents a framework for graph clustering where users play a strong role. In the framework, a soft computing method produces a clustering of the graph and a visualization of it is provided using some graph drawing techniques. Through the visualization the user can then analyze the clustering and...
متن کاملScalable Graph Clustering with Pregel
We outline a method for constructing in parallel a collection of local clusters for a massive distributed graph. For a given input set of (vertex, cluster size) tuples, we compute approximations of personal PageRank vectors in parallel using Pregel, and sweep the results using MapReduce. We show our method converges to the serial approximate PageRank, and perform an experiment that illustrates ...
متن کاملScalable Motif-aware Graph Clustering
We develop new methods based on graph motifs for graph clustering, allowing more efficient detection of communities within networks. We focus on triangles within graphs, but our techniques extend to other clique motifs as well. Our intuition, which has been suggested but not formalized similarly in previous works, is that triangles are a better signature of community than edges. We therefore ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering
سال: 2019
ISSN: 1041-4347,1558-2191,2326-3865
DOI: 10.1109/tkde.2018.2828086